Distinguishing Primitive Permutation Groups
نویسنده
چکیده
Let G be a permutation group acting on a set V . A partition π of V is distinguishing if the only element of G that fixes each cell of π is the identity. The distinguishing number of G is the minimum number of cells in a distinguishing partition. We prove that if G is a primitive permutation group and |V | ≥ 336, its distinguishing number is two.
منابع مشابه
Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups
A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k cells such that only the identity permutation in G fixes setwise all of the cells of the partition. The least cardinal number k such that (G,V ) is k-distinguishable is its distinguishing number, D(G,V ). In particular, a graph Γ is k-distinguishable if its automorphism group Aut(Γ) satisfies D(Aut...
متن کاملDistinguishability of Infinite Groups and Graphs
The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph Γ is said to have connectivity 1 if there exists a vertex α ...
متن کاملThe Minimal Base Size of Primitive Solvable Permutation Groups
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. Answering a question of Pyber, we prove that all primitive solvable permutation groups have a base of size at most four.
متن کاملOn the Relational Complexity of a Finite Permutation Group
The relational complexity ρ(X,G) of a finite permutation group is the least k for which the group can be viewed as an automorphism group acting naturally on a homogeneous relational system whose relations are k-ary (an explicit permutation group theoretic version of this definition is also given). In the context of primitive permutation groups, the natural questions are (a) rough estimates, or ...
متن کاملFinding Efficient Distinguishers for Cryptographic Mappings, with an Application to the Block Cipher TEA
The construction of a distinguisher (Knudsen and Meier 2000) (i.e., an algorithm that is able of distinguishing a random permutation or random mapping from a given cryptographic primitive, such as a block cipher or hash function) is one of the main objectives of a cryptanalyst. Although a distinguisher may or may not be used to recover some of the plaintext or key bits, the existence of an effi...
متن کامل